Mojito under Churn
نویسنده
چکیده
In a dynamic hash table (DHT), peers in a network cooperate to maintain a distributed keyvalue storage. Each peer in a DHT is responsible for storing a subset of keys and their values. Especially in a peer-to-peer system, the peers may not be stable. New peers join and existing peers either fail or leave the system. This process, called churn, requires the DHT to be able to reorganize itself. This paper looks at the performance of a specific DHT, called Mojito, as peers join and leave.
منابع مشابه
Distributed Selfish Replication under Node Churn
In this paper the impact of node churn on the effectiveness of a distributed selfish replication group is investigated. In such a group, nodes cooperate in deciding which objects to store, so that the cost of providing content to their clientele be decreased, compared to that induce when operating in isolation. In order for a cooperation scheme to be sustainable, nodes should not be mistreated;...
متن کاملHandling node churn in decentralised network coordinate system
A Network Coordinate (NC) system is an efficient mechanism to predict Internet distance with scalable measurements. In this paper, we focus on the node churn problem – the continuous process of nodes arrival and departure – in distributed applications. Studies on Vivaldi, a representative distributed NC system, show that under node churn the prediction accuracy of the NC system will be seriousl...
متن کاملStochastic analysis of the interplay between object maintenance and churn
Due to the prevalence of peer dynamics (i.e., churn), object maintenance becomes a fundamental issue in peer-to-peer storage systems. Although quite a few prototypes have been designed and implemented, they lack theoretical analysis to shed light on how the system evolves under churn and how to configure the system properly. The performance of peer-to-peer storage systems under churn (e.g., sto...
متن کاملHandling Node Churn in Decentralized Network Coordinate System
Network coordinates (NC) system is an efficient mechanism to predict Internet distance with scalable measurements. In this paper, we focus on the node churn problem the continuous process of nodes arrival and departure in distributed applications. Studies on Vivaldi, a representative distributed NC system, shows that under node churn the prediction accuracy of the NC system will be seriously im...
متن کاملA Statistical Theory of Chord Under Churn
Most earlier studies of DHTs under churn have either depended on simulations as the primary investigation tool, or on establishing bounds for DHTs to function. In this paper, we present a complete analytical study of churn using a master-equation-based approach, used traditionally in non-equilibrium statistical mechanics to describe steadystate or transient phenomena. Simulations are used to ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009